Blink characterization using curve fitting and clustering algorithms
نویسندگان
چکیده
منابع مشابه
Signal detection Using Rational Function Curve Fitting
In this manuscript, we proposed a new scheme in communication signal detection which is respect to the curve shape of received signal and based on the extraction of curve fitting (CF) features. This feature extraction technique is proposed for signal data classification in receiver. The proposed scheme is based on curve fitting and approximation of rational fraction coefficients. For each symbo...
متن کاملClustering and Curve Fitting by Line Segments
Nonlinear nonparametric statistics (NNS) algorithm offers new tools for curve fitting. 1 A relationship between k-means clustering and NNS regression points is explored with graphics 2 showing a perfect fit in the limit. The goal of this paper is to demonstrate NNS as a form of 3 unsupervised learning, and supply a proof of its limit condition. The procedural similarity NNS 4 shares with vector...
متن کاملCurve-fitting Algorithms for Shape Error Concealment
Introduction of Video Objects (VOs) is one of the major contributions of MPEG-4 to the previous MPEG standards. The a-plane of a VO defines its shape and hence determines the boundary of its texture. In error prone communication networks, shape information, as well as texture information is subject to bit error contamination. In this paper, we propose two post-processing shape concealment techn...
متن کاملStatistical efficiency of curve fitting algorithms
We study the problem of fitting parametrized curves to noisy data. Under certain assumptions (known as Cartesian and radial functional models), we derive asymptotic expressions for the bias and the covariance matrix of the parameter estimates. We also extend Kanatani’s version of the Cramer-Rao lower bound, which he proved for unbiased estimates only, to more general estimates that include many...
متن کاملOn the complexity of curve fitting algorithms
We study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find precise conditions under which this is possible. It turns out that this is, indeed, possible when one fits circles but not ellipses or hyperbolas. In many applicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modeling and Artificial Intelligence in Ophthalmology
سال: 2017
ISSN: 2468-3930,2468-3922
DOI: 10.35119/maio.v1i3.38